Propositional Information Systems

نویسندگان

  • Jürg Kohlas
  • Rolf Haenni
  • Serafín Moral
چکیده

Resolution is an often used method for deducation in propositional logic Here a proper organisation of deduction is proposed which avoids redundant computations It is based on a generic framework of decompositions and local computations as intro duced by Shafer Shenoy The system contains the two basic operations with informations namely marginalization or projection and combination the latter be ing an idempotent operation in the present case The theory permits the conception of an architecture of distributed computing As an important application assumption based reasoning is discussed

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Modelling uncertainty with propositional assumption-based systems

This paper proposes assumption-based systems as an efficient and convenient way to encode uncertain information. Assumptionbased systems are obtained from propositional logic by including a special type of propositional symbol called assumption. Assumptions are needed to express the uncertainty of the given information. Assumptionbased systems can be used to judge hypotheses qualitatively or qu...

متن کامل

Data Leakage Analysis of the Hibernate Query Language on a Propositional Formulae Domain

This paper presents an information flow analysis of Hibernate Query Language (HQL). We define a concrete semantics of HQL and we lift the semantics on an abstract domain of propositional formulae. This way, we capture variables dependences at each program point. This allows us to identify illegitimate information flow by checking the satisfiability of propositional formulae with respect to a tr...

متن کامل

Probabilistic argumentation systems: A new way to combine logic with probability

Probability is usually closely related to Boolean structures, i.e. Boolean algebras or propositional logic. Here we show, how probability can be combined with Non-Boolean structures, and in particular Non-Boolean logics. The basic idea is to describe uncertainty by (Boolean) assumptions, which may or may not be valid. The uncertain information depends then on these uncertain assumptions, scenar...

متن کامل

Pattern-Based Approach for Designing with Diagrammatic and Propositional Conceptual Models

A conceptual modeling approach for Ubiquitous Information Systems (UIS) is presented as a central part of a UIS design methodology. Three conceptual models are used for step-wise derivation of machine-executable design models for distributed service infrastructures: narratives, pattern-based diagrammatic conceptual models (Pre-Artifacts), and formalized propositional conceptual models.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1999